International Journal of Computational Geometry & Applications C World Scientiic Publishing Company an Algorithm for Drawing a Hierarchical Graph
نویسندگان
چکیده
منابع مشابه
International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Parallelizing an Algorithm for Visibility on Polyhedral Terrain
The best known output-sensitive sequential algorithm for computing the viewshed on a polyhedral terrain from a given viewpoint was proposed by Katz, Overmars, and Sharir 10 , and achieves time complexity O((k + nn(n)) log n) where n and k are the input and output sizes respectively, and () is the inverse Ackermann's function. In this paper, we present a parallel algorithm that is based on the w...
متن کاملInternational Journal of Computational Geometry & Applications C World Scientiic Publishing Company Rounding Arrangements Dynamically
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT We describe a robust, dynamic algorithm to compute the arrangement of a set of line segments in the plane, and its implementation. The algorithm is robust because, following Greene 1 and Hobby, 2 it rounds the endpoints and intersections of all line segments to representable points, but in a way that is globa...
متن کاملInternational Journal of Computational Geometry & Applications C World Scientiic Publishing Company Virtual Geoexploration: Concepts and Design Choices
A trip through a virtual world is a powerful metaphor and a natural way of interacting with a geographic information system (GIS). Virtual reality (VR) systems provide visual realism and real-time navigation and interaction for data in core, but fail to cope with very large amounts of data, and to provide the general functionality of information systems. We describe a prototype system that over...
متن کاملParallel Processing Letters C World Scientiic Publishing Company a Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings (or more simply, layouts) of graphs, with the goal of minimizing the number of bends along the edges. We present optimal parallel algorithms that construct graph layouts with O(n) maximum edge length, O(n 2) area, and at most 2n + 4 bends (for biconnected graphs) and 2:4n + 2 bends (for simply connected graphs...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995